Automatic swept volume decomposition based on sweep directions extraction for hexahedral meshing
نویسندگان
چکیده
Automatic and high quality hexahedral meshing of complex solid models is still a challenging task. To guarantee the quality of the generated mesh, current commercial software normally requires users to manually decompose a complex solid model into a set of simple geometry like swept volume whose high quality hexahedral mesh can be easily generated. The manual decomposition is a time-consuming process, and its effect heavily depends on the user’s experience. Therefore, to automate the solid model decomposition for hexahedral meshing is of significance. However, the efficiency of the existing algorithms are still far from expected. In this paper, an automatic swept volume decomposition approach based on sweep directions extraction is presented. The approach first extracts all the potential local sweep directions (PLSDs) of a given solid model using heuristic rules, then generates a relevant face set (RFS) for each PLSD, and incrementally determines all the swept volumes including heavily interacting ones based on PLSDs. Furthermore, to make the decomposition good for high quality hexahedral meshing, the approach constructs reasonable cutting face sets (CFSs) to split the interacting swept volumes. Experimental results show the effectiveness of our approach. c © 2014 The Authors. Published by Elsevier Ltd. Peer-review under responsibility of organizing committee of the 23rd International Meshing Roundtable (IMR23).
منابع مشابه
Automatic scheme selection for toolkit hex meshing
Current hexahedral mesh generation techniques rely on a set of meshing tools, which when combined with geometry decomposition leads to an adequate mesh generation process. Of these tools, sweeping tends to be the workhorse algorithm, accounting for at least 50 per cent of most meshing applications. Constraints which must be met for a volume to be sweepable are derived, and it is proven that the...
متن کاملAn Approach to the Automatic Recognition of Boolean Decomposition Loops for Swept Volume Decomposition
Hexahedral meshing needs performing volume decomposition that decomposes a complex shape into simple hex meshable sub-domains, which is a very time-consuming and experience needed work. It is necessary to research and develop intelligent swept volume decomposition approaches. The fundamental work of the volume decomposition approaches based on reconstruction of swept features is to recognize th...
متن کاملAutomatic decomposition of complex thin walled CAD models for hexahedral dominant meshing
This paper describes an automatic method for identifying thin-sheet regions (regions with large lateral dimensions relative to the thickness) for complex thin walled components, with a view to using this information to guide the hex meshing process. This fully automated method has been implemented in a commercial CAD system (Siemens NX) and is based on the interrogation and manipulation of face...
متن کاملAutomatic Hexahedral Mesh Generation by Recursive Convex and Swept Volume Decomposition
In this paper we present a recursive volume decomposition method for automatically decomposing complex shaped objects with both protrusions and depressions into simpler sub-objects for automatic hexahedral mesh generation. The sub-volumes after decomposition are classified into either convex or swept volumes. For a convex volume, it is mapped to a collection of hexahedral objects. On the other ...
متن کاملVolume Decomposition and Feature Recognition for Hexahedral Mesh Generation
Considerable progress has been made on automatic hexahedral mesh generation in recent years. Several automatic meshing algorithms have proven to be very reliable on certain classes of geometry. While it is always worth pursuing general algorithms viable on more general geometry, a combination of the well-established algorithms is ready to take on classes of complicated geometry. By partitioning...
متن کامل